Comparing cognitive maps using graph algorithms.
نویسندگان
چکیده
منابع مشابه
Fuzzy Cognitive Maps Learning using Memetic Algorithms
Memetic Algorithms (MAs) are proposed for learning in Fuzzy Cognitive Maps (FCMs). MAs are hybrid search schemes, which combine a global optimization algorithm and a local search one. FCM’s learning is accomplished through the optimization of an objective function with respect to the weights of the FCM. MAs are used to solve this optimization task. The proposed approach is applied to a well-est...
متن کاملLearning algorithms for fuzzy cognitive maps
Fuzzy Cognitive Maps have been introduced as a combination of Fuzzy logic and Neural Networks. In this paper a new learning rule based on unsupervised Hebbian learning and a new training algorithm based on Hopfield nets are introduced and are compared for the training of Fuzzy Cognitive Maps.
متن کاملGraph Partitioning Using Genetic Algorithms
The eecient implementation of parallel processing ar-chitectures generally requires the solution of hard combi-natorial problems involving allocation and scheduling of tasks. Such problems can often be modelled with considerable accuracy as a graph partitioning problem|a problem well-known from complexity theory to be NP-hard, which implies that for practical purposes the global optimum will no...
متن کاملGlobal graph matching using diffusion maps
We present a new algorithm, global positioning graph matching (GPGM), to perform global network alignments between pairs of undirected graphs by minimizing a dissimilarity score over matched vertices. We define structural dissimilarities based on a random walk over each graph to provide a robust measure of the global graph topology using a nonlinear manifold learning algorithm known as diffusio...
متن کاملAdaptation of fuzzy cognitive maps by migration algorithms
1 Introduction Knowledge-based systems utilize mostly production rules, mainly because of their human-friendly knowledge representation, which will be the case if the rules are mutually independent; i.e. outputs of any rule do not enter antecedents of any other rule and so decision chains and closed loops are not created. Such systems will be hereafter referred to as 'simple' rule-based systems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Classification Research Online
سال: 2011
ISSN: 2324-9773
DOI: 10.7152/acro.v11i1.12781